Erasure Coding for Fault-Oblivious Linear System Solvers
نویسندگان
چکیده
منابع مشابه
Erasure coding for fault oblivious linear system solvers
Dealing with faults is an important problem as parallel and distributed systems scale to millions of processing cores. Traditional methods for dealing with faults include checkpoint-restart, active replicas, and deterministic replay. Each of these techniques has associated resource overheads and constraints. In this paper, we propose an alternate approach to dealing with faults based on input a...
متن کاملFault-tolerant linear solvers via selective reliability
interface. The Failable interface has methods for marking, unmarking, and checking whether the object’s data are allowed to experience bit flips. FTGMRES mark failability of the relevant objects on entry to the inner solver, and unmarks them on exit. We describe below how we implemented this high-level interface using the low-level application / OS interface presented in Section 9. Trilinos is ...
متن کاملEfficient Linear System Solvers for Mesh Processing
The use of polygonal mesh representations for freeform geometry enables the formulation of many important geometry processing tasks as the solution of one or several linear systems. As a consequence, the key ingredient for efficient algorithms is a fast procedure to solve linear systems. A large class of standard problems can further be shown to lead more specifically to sparse, symmetric, and ...
متن کاملHybrid Parallel Linear System Solvers
This paper presents a new approach to the solution of nonsymmetric linear systems that uses hybrid techniques based on both direct and iterative methods An implicitly preconditioned modi ed system is obtained by applying projections onto block rows of the original system Our technique provides the exibility of using either direct or iter ative methods for the solution of the preconditioned syst...
متن کاملLinear System Solvers : Sparse Iterative
In this chapter we will present an overview of a number of related iterative methods for the solution of linear systems of equations. These methods are so-called Krylov projection type methods and they include popular methods as Conjugate Gradients, Bi-Conjugate Gradients, LSQR and GMRES. We will sketch how these methods can be derived from simple basic iteration formulas, and how they are inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2017
ISSN: 1064-8275,1095-7197
DOI: 10.1137/15m1041511